Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Gregory Kucherov And NotHaute-Normandie

List of bibliographic references

Number of relevant bibliographic references: 99.
Ident.Authors (with country if any)Title
004154 Fabrice Touzain ; Sophie Schbath [France] ; Isabelle Debled-Rennesson [France] ; Bertrand Aigle [France] ; Gregory Kucherov [France] ; P. LeblondSIGffRid: A tool to search for sigma factor binding sites in bacterial genomes using comparative approach and biologically driven statistics
004205 Fabrice Touzain [France] ; Sophie Schbath ; Isabelle Debled-Rennesson ; Bertrand Aigle ; Gregory Kucherov ; Pierre LeblondSIGffRid: a tool to search for sigma factor binding sites in bacterial genomes using comparative approach and biologically driven statistics.
005029 Johanne Cohen [France] ; Fedor Fomin [Norvège] ; Pinar Heggernes [Norvège] ; Dieter Kratsch [France] ; Gregory Kucherov [France]Optimal Linear Arrangement of Interval Graphs
005274 Gregory Kucherov ; Laurent Noé ; Mihkail RoytbergA unifying framework for seed sensitivity and its application to subset seeds
005416 Johanne Cohen [France] ; Fedor Fomin [Norvège] ; Pinar Heggernes [Norvège] ; Dieter Kratsch [France] ; Gregory Kucherov [France]Optimal Linear Arrangement of Interval Graphs
005849 Mathieu Giraud [France] ; Laurent Noé [France] ; Gregory Kucherov [France] ; Dominique Lavenier [France]Recherches de motifs et de similarités en bioinformatique : modélisations, solutions logicielles et matérielles
005971 Fabrice Touzain [France] ; Sophie Schbath [France] ; Isabelle Debled-Rennesson [France] ; Bertrand Aigle [France] ; Pierre Leblond [France] ; Gregory Kucherov [France]SIGffRid : Programme de recherche des sites de fixation des facteurs de transcription par approche comparative
005B86 Fabrice Touzain ; Sophie Schbath ; Isabelle Debled-Rennesson ; Bertrand Aigle ; Pierre Leblond ; Gregory KucherovSIGffRid : Programme de recherche des sites de fixation des facteurs de transcription par approche comparative
005D42 Mathilde Bouvel ; Vladimir Grebinski ; Gregory KucherovCombinatorial search on graphs motivated by bioinformatics applications : a brief survey
005D51 Gregory Kucherov ; Laurent Noé ; Mikhail RoytbergMulti-seed lossless filtration
005F01 Laurent Noé ; Gregory KucherovYASS : Enhancing the sensitivity of DNA similarity search
006012 Gregory Kucherov ; Laurent Noé ; Mikhail RoytbergA unifying framework for seed sensitivity and its application to subset seeds
006161 Laurent Noe [France] ; Gregory Kucherov [France]YASS: enhancing the sensitivity of DNA similarity search
006289 Mathilde Bouvel [France] ; Vladimir Grebinski [États-Unis] ; Gregory Kucherov [France]Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey
006316 Gregory Kucherov [France] ; Laurent Noé [France] ; Mikhail Roytberg [Russie]A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds
006649 Gregory Kucherov [France] ; Laurent Noé [France] ; Yann Ponty [France]Estimating seed sensitivity on homogeneous alignments
006838 Gregory Kucherov ; Laurent Noé ; Mikhail RoytbergMulti-seed lossless filtration
006885 Gregory Kucherov ; Laurent Noé ; Yann PontyEstimating seed sensitivity on homogeneous alignments
006934 Laurent Noé ; Gregory KucherovYASS : Enhancing the sensitivity of DNA similarity search
006935 Laurent Noé ; Gregory KucherovImproved hit criteria for DNA local alignment
006A39 Laurent Noé ; Gregory KucherovImproved hit criteria for DNA local alignment
006B65 Gregory Kucherov [France] ; Laurent Noé [France] ; Mikhail Roytberg [Russie]Multi-seed Lossless Filtration
006E47 Laurent Noé [France] ; Gregory Kucherov [France]YASS : Enhancing the sensitivity of DNA similarity search
006F16 Roman Kolpakov ; Gregory Kucherov [France]Periodic Structures in Words
006F88 Laurent Noé [France] ; Gregory Kucherov [France]Improved hit criteria for DNA local alignment
007056 Alexey Vitreschak [France] ; Sergey Hosid ; Alexander Bolshoy ; Gregory Kucherov [France]Computer analysis of rrn regulatory signals on both DNA sequence and structural levels in proteobacteria
007057 Alexey Vitreschak [France] ; Laurent Noé [France] ; Gregory Kucherov [France]Computer analysis of multiple repeats in bacteria
007094 Gregory Kucherov [France] ; Laurent Noé [France] ; Mikhail RoytbergA unifying framework for seed sensitivity and its application to subset seeds
007199 Jean-Pierre Duval [France] ; Roman Kolpakov ; Gregory Kucherov [France] ; Thierry Lecroq [France] ; Arnaud Lefebvre [France]Linear-Time Computation of Local Periods
007270 Gregory Kucherov [France] ; Laurent Noé [France]YASS : similarity search in DNA sequences
007354 Gregory Kucherov ; Laurent NoéYASS : similarity search in DNA sequences
007445 Gregory Kucherov [France] ; Pascal Ochem ; Michael Rao [France]How many square occurrences must a binary sequence contain?
007484 Fabrice Touzain ; Patricia Lavigne ; Isabelle Debled-Rennesson ; Bertrand Aigle ; Pierre Leblond ; Gregory KucherovIdentification of Transcription Factor Binding Sites in Streptomyces coelicolor A3(2) by Phylogenetic Comparison
007502 Patricia Lavigne ; Isabelle Debled-Rennesson ; Bertrand Aigle ; Pierre Leblond ; Gregory KucherovIdentification of transcription factor binding sites in the genome of Streptomyces coelicolor A3(2)
007618 Gregory Kucherov ; Laurent Noé ; Yann PontyEstimating seed sensitivity on homogeneous alignments
007692 Laurent Noé ; Gregory KucherovYASS : Similarity search in DNA sequences
007710 Roman Kolpakov ; Gregory KucherovFinding approximate repetitions under Hamming distance
007759 Jean-Pierre Duval ; Roman Kolpakov ; Gregory Kucherov ; Thierry Lecroq ; Arnaud LefebvreLinear-Time Computation of Local Periods
007856 Gregory Kucherov ; Pascal Ochem ; Michael RaoHow many square occurrences must a binary sequence contain?
007864 Roman Kolpakov ; Ghizlane Bana ; Gregory Kucherovmreps : efficient and flexible detection of tandem repeats in DNA
007885 Roman Kolpakov ; Ghizlane Bana ; Gregory Kucherovmreps: efficient and flexible detection of tandem repeats in DNA
007959 Roman Kolpakov ; Ghizlane Bana [France] ; Gregory Kucherov [France]mreps: efficient and flexible detection of tandem repeats in DNA
007B62 Roman Kolpakov [Russie] ; Gregory Kucherov [France]Finding approximate repetitions under Hamming distance
007D20 Laurent Noé [France] ; Gregory Kucherov [France]YASS: Similarity search in DNA sequences
007E12 Patricia Lavigne [France] ; Isabelle Debled-Rennesson [France] ; Bertrand Aigle ; Pierre Leblond ; Gregory Kucherov [France]Identification of transcription factor binding sites in the genome of Streptomyces coelicolor A3(2)
007E13 Fabrice Touzain [France] ; Patricia Lavigne [France] ; Isabelle Debled-Rennesson [France] ; Bertrand Aigle ; Pierre Leblond ; Gregory Kucherov [France]Identification of Transcription Factor Binding Sites in Streptomyces coelicolor A3(2) by Phylogenetic Comparison
007E27 Gregory Kucherov [France] ; Laurent Noé [France] ; Yann PontyEstimating seed sensitivity on homogeneous alignments
007F48 Laurent Noé [France] ; Gregory Kucherov [France]A new method of finding similarity regions in DNA sequences
008068 Ghizlane Bana [France] ; Roman Kolpakov ; Mathieu Giraud [France] ; Ralph Rabbat ; Gregory Kucherov [France]mreps: a program for exhaustive search for tandem repeats in DNA sequences
008187 Ghizlane Bana ; Roman Kolpakov ; Mathieu Giraud ; Ralph Rabbat ; Gregory Kucherovmreps : a program for exhaustive search for tandem repeats in DNA sequences
008521 Laurent Noé ; Gregory KucherovA new method of finding similarity regions in DNA sequences
008655 Gregory Kucherov ; Pascal Ochem ; Michael RaoHow many square occurrences must a binary sequence contain
008B31 Gregory Kucherov [France] ; Pascal Ochem [France] ; Michael Rao [France]How many square occurrences must a binary sequence contain
008C75 Roman Kolpakov [France] ; Gregory Kucherov [France]Finding Approximate Repetitions under Hamming Distance
009000 Roman Kolpakov ; Gregory KucherovFinding Approximate Repetitions under Hamming Distance
009001 Roman Kolpakov ; Gregory KucherovFinding Approximate Repetitions under Hamming Distance
009349 Roman Kolpakov [France] ; Gregory Kucherov [France]Finding Approximate Repetitions under Hamming Distance
009654 Roman Kolpakov [France] ; Gregory Kucherov [France]Finding approximate repetitions under Hamming distance
009A07 Vladimir Grebinski ; Gregory KucherovOptimal Reconstruction of Graphs under the Additive Model
009E47 Gregory Kucherov [France] ; Michaël Rusinowitch [France]Patterns in Words versus Patterns in Trees: A Brief Survey and New Results
00A224 Roman Kolpakov ; Gregory Kucherov [France]Finding Repeats With Fixed Gap
00A438 Gregory Kucherov ; Michael RusinowitchPatterns in words versus patterns in trees : a brief survey and new results
00A596 Roman Kolpakov ; Gregory KucherovFinding Maximal Repetitions in a Word in Linear Time
00A686 Roman Kolpakov ; Gregory Kucherov ; Yuri TarannikovOn repetition-free binary words of minimal density
00A704 Roman Kolpakov ; Gregory KucherovOn the sum of exponents of maximal repetitions in a word
00A706 David Plaisted ; Gregory KucherovThe Complexity of Some Complementation Problems
00A736 David Plaisted ; Gregory KucherovThe complexity of some complementation problems
00A763 Vladimir Grebinski ; Gregory KucherovReconstructing Set Partitions
00A825 David A. Plaisted [États-Unis] ; Gregory Kucherov [États-Unis, France]The complexity of some complementation problems
00A837 Roman Kolpakov [Russie] ; Gregory Kucherov [France] ; Yuri Tarannikov [Russie]On repetition-free binary words of minimal density
00A960 Roman Kolpakov [Russie] ; Gregory Kucherov [France]On maximal repetitions in words
00AC18 David A. Plaisted ; Gregory Kucherov [France]The Complexity of Some Complementation Problems
00AC49 Vladimir Grebinski [France] ; Gregory Kucherov [France]Reconstructing Set Partitions
00AC60 Gregory Kucherov [France] ; Michaël Rusinowitch [France]Patterns in words versus patterns in trees : a brief survey and new results
00AC66 Roman Kolpakov [France] ; Gregory Kucherov [France]On the sum of exponents of maximal repetitions in a word
00AD12 Roman Kolpakov ; Gregory Kucherov [France]Finding Maximal Repetitions in a Word in Linear Time
00AE97 Vladimir Grebinski ; Gregory Kucherov [France]Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping
00AF34 Vladimir Grebinski ; Gregory KucherovReconstructing a Hamiltonian Cycle by Querying the Graph : Application to DNA Physical Mapping
00B059 Roman Kolpakov ; Gregory KucherovMaximal Repetitions in Words or How to Find all Squares in Linear Time
00B067 Roman Kolpakov ; Gregory Kucherov ; Yuri TarannikovOn repetition-free binary words of minimal density
00B306 François Bertault [France] ; Gregory Kucherov [France]Visualization of dynamic automata using Padnon
00B337 Roman Kolpakov [France] ; Gregory Kucherov [France] ; Yuri Tarannikov [Russie]On repetition-free binary words of minimal density
00B631 Roman Kolpakov [France] ; Gregory Kucherov [France]Maximal Repetitions in Words or How to Find all Squares in Linear Time
00B866 Vladimir Grebinski ; Gregory KucherovOptimal Reconstruction of Graphs Under the Additive Model
00B960 Vladimir Grebinski ; Gregory KucherovOptimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs
00B968 Gregory Kucherov ; Michael RusinowitchMatching a Set of Strings with Variable Length Don't Cares
00BA84 Roman Kolpakov ; Gregory KucherovMinimal Letter Frequency in n-power-free Binary Words
00BB32 Gregory Kucherov [France] ; Michaël Rusinowitch [France]Matching a set of strings with variable length don't cares
00BC29 Vladimir Grebinski [France] ; Gregory Kucherov [France]Optimal reconstruction of graphs under the additive model
00BC35 Roman Kolpakov [Russie] ; Gregory Kucherov [France]Minimal letter frequency in n -th power-free binary words
00BE17 Vladimir Grebinski ; Gregory KucherovReconstructing a Hamiltonian Circuit by Querying the Graph : Application to DNA Physical Mapping
00BF28 Gregory Kucherov [France] ; Pierre Lescanne [France] ; Peter Mosses [Danemark]Valentin Antimirov (1961–1995)
00C396 Gregory Kucherov ; Michael RusinowitchMatching a Set of Strings with Variable Length Don't Cares
00C607 Gregory Kucherov [France] ; Michaël Rusinowitch [France]Undecidability of ground reducibility for word rewriting systems with variables
00C692 Gregory Kucherov [France] ; Michaël Rusinowitch [France]The complexity of testing ground reducibility for linear word rewriting systems with variables
00C736 Gregory Kucherov [France] ; Michaël Rusinowitch [France]Matching a set of strings with variable length don't cares
00CC87 Dieter Hofbauer [Allemagne] ; Maria Huber [France] ; Gregory Kucherov [France]Some results on top-context-free tree languages
00D203 Gregory Kucherov [France] ; Mohamed Tajine [France]Decidability of regularity and related properties of ground normal form languages
00F189 Gregory Kucherov [France] ; Laurent Noé ; Mikhail RoytbergMultiseed lossless filtration.

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022